Hierarchical Spectral Clustering of Power Grids
نویسندگان
چکیده
منابع مشابه
Hierarchical Fuzzy Spectral Clustering in Social Networks using Spectral Characterization
An important aspect of community analysis is not only determining the communities within the network, but also sub-communities and hierarchies. We present an approach for finding hierarchies in social networks that uses work from random matrix theory to estimate the number of clusters. The method analyzes the spectral fingerprint of the network to determine the level of hierarchy in the network...
متن کاملHierarchical reconstruction for spectral volume method on unstructured grids
The hierarchical reconstruction (HR) [9, 20] is applied to a piecewise quadratic spectral volume method on two-dimensional unstructured grids as a limiting procedure to prevent spurious oscillations in numerical solutions. The key features of this HR are that the reconstruction on each control volume only uses adjacent control volumes, which forms a compact stencil set, and there is no truncati...
متن کاملSpectral Clustering via the Power Method - Provably
Spectral clustering is arguably one of the most important algorithms in data mining and machine intelligence; however, its computational complexity makes it a challenge to use it for large scale data analysis. Recently, several approximation algorithms for spectral clustering have been developed in order to alleviate the relevant costs, but theoretical results are lacking. In this paper, we pre...
متن کاملHierarchical Sparse Spectral Clustering For Image Set Classification
We present a structural matching technique for robust classification based on image sets. In set based classification, a probe set is matched with a number of gallery sets and assigned the label of the most similar set. We represent each image set by a sparse dictionary and compute a similarity matrix by matching all the dictionary atoms of the gallery and probe sets. The similarity matrix comp...
متن کاملAgglomerative hierarchical kernel spectral clustering for large scale networks
We propose an agglomerative hierarchical kernel spectral clustering (AH-KSC) model for large scale complex networks. The kernel spectral clustering (KSC) method uses a primal-dual framework to build a model on a subgraph of the network. We exploit the structure of the projections in the eigenspace to automatically identify a set of distance thresholds. These thresholds lead to the different lev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2014
ISSN: 0885-8950,1558-0679
DOI: 10.1109/tpwrs.2014.2306756